If NP has polynomial-size circuits, then MA = AM
نویسندگان
چکیده
منابع مشابه
If NP has Polynomial-Size Circuits, then MA=AM
It is shown that the assumption of NP having polynomial size circuits implies apart from a collapse of the polynomial time hierarchy as shown by Karp and Lip ton that the classes AM and MA of Babai s Arthur Merlin hierarchy coincide This means that also a certain inner collapse of the remaining classes of the polynomial time hierarchy occurs It is well known KL that the assumption of NP having ...
متن کاملIf P != NP Then Some Strongly Noninvertible Functions Are Invertible
Rabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show—via explicit cryptographic protocols for secret-key agreement ([RS93,RS97] attribute this to Rivest and Sherman) and digital signatures [RS93,RS97]—that strongly noninvertible functions would be very useful components in protocol design. Their definition of strong ...
متن کاملOn Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant
We consider the problem of fixed-polynomial lower bounds on the size of arithmetic circuits computing uniform families of polynomials. Assuming the generalised Riemann hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in MA having no arithmetic circuits of size O(n) over C (allowing any complex constant). We also build a family of polynomials that can be evalua...
متن کاملEven if after If then conditionals
This study evaluates how people represent “even if” conditionals when they have to integrate them with previous “if then” conditionals and also make an inference. The terms in the premises were ordered to facilitate their integration (Figure 1: If A then B; Even if B C). In half the cases, the “even if” conditional was expressed with a negation instead of an affirmation (If A then B; Even if no...
متن کاملDefinability by Constant-Depth Polynomial-Size Circuits
A function of boolean arguments is symmetric if its value depends solely on the number of l 's among its arguments. In the first part of this paper we partially characterize those symmetric functions that can be computed by constant-depth polynomial-size sequences of boolean circuits, and discuss the complete characterization. (We treat both uniform and non-uniform sequences of circuits.) Our r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)91133-b